Network Coding and Related Combinatorial Structures List of References
نویسندگان
چکیده
منابع مشابه
Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کاملDistribution Network Expansion Using Hybrid SA/TS Algorithm
Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be solved by optimization algorithms. This paper presents a new hybrid simulated annealing and tabu search algorithm for distribution network expan...
متن کاملGenerating the Nine-Point Graphs
A program has been written which recently generated all the (unlabelled) nine-point graphs. Written in MACRO-10 assembly language and run on a 165K PDP10, it generates the complete set of 274,668 graphs in less than six hours. The algorithm on which this program is based is discussed with an emphasis on coding of graphs and various programming techniques designed to save space and time during e...
متن کاملApplications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory
The aim of this workshop was to bring together experts and students from pure and applied mathematics, computer science, and engineering, who are working on related problems in the areas of matroid theory, combinatorial optimization, coding theory, secret sharing, network coding, and information inequalities. The goal was to foster exchange of mathematical ideas and tools that can help tackle s...
متن کاملA Brief Survey of Difference Sets, Partial Difference Sets, and Relative Difference Sets
Difference sets, partial difference sets, and relative difference sets are algebraic structures with combinatorial applications. The purpose of this paper is to give the reader definitions and basic examples of these sets, as well describe their connections to some other well-known combinatorial objects. We will conclude with some examples that illustrate how character theory can be used to pro...
متن کامل